Binary Tree Based Forward Secure Signature Scheme in the Random Oracle Model

نویسندگان

چکیده

In this paper we construct and consider a new group-based digital signature scheme with evolving secret key, which is built using bilinear map. This map an asymmetric pairing of Type 3, although, for the reason paper, it treated in completely abstract fashion ought to be viewed as being actually defined over $E(\FF_{q^{n}})[p]\times E(\FF_{q^{nk}})[p]\to \FF_{q^{nk}}[p]$. The crucial element key updater algorithm. With adoption pairings binary trees where number leaves same time periods, are assured that updated can not used recover any its predecessors. This, consequence, means forward-secure. To formally justify assertion, conduct analysis \fucma~security model by reducing security computational hardness solving Weak $\ell$-th Bilinear Diffie-Hellman Inversion problem type. We define explain why source cryptographic schemes. As reduction itself, general case, could possible make only random oracle model.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Forward Secure Threshold Signature Scheme Based on the Structure of Binary Tree

Forward secure threshold signature plays an important role in distributed signature. Based on binary tree structure, a new forward secure threshold signature from bilinear pairings is proposed in this paper. In this scheme, each cost of key generation algorithm, key update algorithm, signing algorithm and verifying algorithm is independent of the total number of time periods. At the same time, ...

متن کامل

Lattice-Based Ring Signature Scheme under the Random Oracle Model

Abstract: On the basis of the signatures scheme without trapdoors from lattice, which is proposed by Vadim Lyubashevsky in 2012, we present a new ring signature scheme from lattice. The proposed ring signature scheme is an extension of the signatures scheme without trapdoors. We proved that our scheme is strongly unforgeable against adaptive chosen message in the random oracle model, and proved...

متن کامل

A Simple Secure Signature Scheme Based on the Strong RSA Assumption without Random Oracle Model

The paper based workflow systems are rapidly being replaced by the electronic based media systems, in which all forms, messages and data are digitally processed; examples as in e-government and e-commerce. In these systems, it is very important to preserve the original contents from any malicious interference. This is a problem of security. Digital signature techniques, which allow transferring...

متن کامل

A provably secure really source hiding designated verifier signature scheme based on random oracle model

A lot of designated verifier signature (DVS) schemes have been proposed. However, all of them only provide the basic security requirement that only the designated verifier can check the validity of the signature. They are either not secure enough or lacking source hiding. Hence, in this article, we design a provably secure DVS scheme. It not only can attain the basic security requirement but al...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Electronics and Telecommunications

سال: 2023

ISSN: ['2300-1933', '2081-8491']

DOI: https://doi.org/10.24425/ijet.2021.137868